On the Discrepancy between Kleinberg’s Clustering Axioms and k-Means Clustering Algorithm Behavior
نویسندگان
چکیده
Abstract This paper performs an investigation of Kleinberg’s axioms (from both intuitive and formal standpoint) as they relate to the well-known k -mean clustering method. The axioms, well a novel variations thereof, are analyzed in Euclidean space. A few natural properties proposed, resulting -means satisfying intuition behind (or, rather, small, variation on that intuition). In particular, two consistency property called centric motion consistency. It is shown these satisfied by k-means.
منابع مشابه
On the Discrepancy Between Kleinberg's Clustering Axioms and k-Means Clustering Algorithm Behavior
This paper investigates the validity of Kleinberg’s axioms for clustering functions with respect to the quite popular clustering algorithm called k-means.We suggest that the reason why this algorithm does not fit Kleinberg’s axiomatic system stems from missing match between informal intuitions and formal formulations of the axioms. While Kleinberg’s axioms have been discussed heavily in the pas...
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملEnhanced Clustering Based on K-means Clustering Algorithm and Proposed Genetic Algorithm with K-means Clustering
-In this paper targeted a variety of techniques, tactics and distinctive areas of the studies that are useful and marked because the crucial discipline of information mining technologies. The overall purpose of the system of statistics mining is to extract beneficial facts from a large set of information and changing it right into a shape that is comprehensible for in addition use. Clustering i...
متن کاملpersistent k-means: stable data clustering algorithm based on k-means algorithm
identifying clusters or clustering is an important aspect of data analysis. it is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. it is a main task of exploratory data mining, and a common technique for statistical data analysis this paper proposed an improved version of k-means algorithm, namely persistent k...
متن کاملFast k-means algorithm clustering
k-means has recently been recognized as one of the best algorithms for clustering unsupervised data. Since k-means depends mainly on distance calculation between all data points and the centers, the time cost will be high when the size of the dataset is large (for example more than 500millions of points). We propose a two stage algorithm to reduce the time cost of distance calculation for huge ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2023
ISSN: ['0885-6125', '1573-0565']
DOI: https://doi.org/10.1007/s10994-023-06308-x